Deduction and Deductive Databases for Geographic Data Handling
نویسندگان
چکیده
The representation of complex spatial domains in conventional databases suuers from fragmented representation of object structure , lack of instance-level spatial relationships, and the generation of large combinatoric search spaces in query analysis. The deductive capabilities provided by a deductive database ooer some assistance in solving these problems, in particular by enabling spatial reasoning to be performed by a Geographic Information System (GIS). Deduction in the database is used to support the natural representation of complex spatial object structures in single and multi-layered Geographic DataBases (GDB), inference of implicit spatial relationships, and the manipulation of multiple resolution spatial representations. In addition, deductive capabilities are shown to be essential for automatic data input and update in a GDB. Coupled with appropriate structural representation, spatial reasoning is an important tool for the realization of an eective GDB.
منابع مشابه
Deduction and Deductive Databases for Geographic Data Handlingg ?
The representation of complex spatial domains in conventional databases suuers from fragmented representation of object structure , lack of instance-level spatial relationships, and the generation of large combinatoric search spaces in query analysis. The deductive capabilities provided by a deductive database ooer some assistance in solving these problems, in particular by enabling spatial rea...
متن کاملFREDDI: A Fuzzy Relational Deductive Database Interface
This paper shows an architecture for Deductive Fuzzy RDBMS which integrates two approaches of fuzzy databases: the relational and the logical ones. It uses the first one to represent and manipulate imprecise information and the second one to obtain intensional information. Besides, it shows how it is possible to use the resources offered by a conventional RDBMS together with a deduction module ...
متن کاملOn Computing the Gcwa
The computational complexity of a number of problems relating to minimal models of deductive databases is considered. In particular, it is shown that Minker's gener-alised closed world assumption (GCWA) is P P 1-complete for stratiied propositional databases and P P 2-complete for non-stratiied databases. The structure of minimal models is also examined using the notion of a weak deduction tree...
متن کاملSpatial Data Management In Database Systems: Research Directions
Realms: A foundation for spatial data types in database systems p. 14 A canonical model for a class of areal spatial objects p. 36 Strong integration of spatial domains and operators in a relational database system p. 53 The transformation technique for spatial objects revisited p. 73 A paging scheme for pointer-based quadtrees p. 89 A hierarchical spatial index for cell complexes p. 105 On opt...
متن کاملCoping with Indefinite and Negative Data in Deductive Databases: A Survey
[Jo93a] C. A. Johnson, Top down deduction in indefinite deductive databases, Keele University technical report (TR93-08).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993